Energy optimized scheduling for non-preemptive real-time systems

A non-preemptive scheduling algorithm for soft real-time systems

1 Please direct all correspondence to Krishna Kavi, Department of Computer Science and Engineering, The University of North Texas, P.O. Box 311366, Denton, Texas 76203, [email protected] Abstract Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring no...

Non-preemptive real-time scheduling of dataflow systems

Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols exten...

An Efficient Non-Preemptive Real-Time Scheduling

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...

Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling

Energy-Centric Scheduling for Real-Time Systems

ENERGY CONSUMPTION is today an important design issue for all kinds of digital systems, and essential for the battery operated ones. An important fraction of this energy is dissipated on the processors running the application software. To reduce this energy consumption, one may, for instance, lower the processor clock frequency and supply voltage. This, however, might lead to a performance degr...